Exponential networked synchronization of master-slave chaotic systems with time-varying communication topologies

The networked synchronization problem of a class of master-slave chaotic systems with time-varying communication topologies is investigated in this paper. Based on algebraic graph theory and matrix theory, a simple linear state feedback controller is designed to synchronize the master chaotic system and the slave chaotic systems with a time- varying communication topology connection. The exponential stability of the closed-loop networked synchronization error system is guaranteed by applying Lyapunov stability theory. The derived novel criteria are in the form of linear matrix inequalities (LMIs), which are easy to examine and tremendously reduce the computation burden from the feedback matrices. This paper provides an alternative networked secure communication scheme which can be extended conveniently. An illustrative example is given to demonstrate the effectiveness of the proposed networked synchronization method.     

A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming

A method for computing global minima of real multivariate polynomials based on semidefinite programming was developed by N.Z. Shor, J.B. Lasserre and P.A. Parrilo. The aim of this article is to extend a variant of their method to noncommutative symmetric polynomials in variables X and Y satisfying YX−XY=1 and X^*=X, Y^*=−Y. Global minima of such polynomials are defined and showed to be equal to minima of the spectra of the corresponding differential operators. We also discuss how to exploit sparsity and symmetry. Several numerical experiments are included. The last section explains how our theory fits into the framework of noncommutative real algebraic geometry.     

Simultaneous approximation by universal series

We show that, if individual universal series exist, then we can choose a sequence of universal series performing simultaneous universal approximation with the same sequence of indices. As an application we derive the existence of universal Laurent Series on an annulus using only the existence of universal Taylor Series on discs. Our results are generic (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

一类随机延迟微分代数系统的Euler-Maruyama方法

我们主要构造了数值求解一类1指标随机延迟微分代数系统的Euler-Maruyama方法,并且证明用该方法求解此类问题可达到1/2阶均方收敛.最后的效值试验验证了方法的有效性及所获结论的正确性.     

Algebraic Bethe Ansatz for the Osp(1|2) Model with Reflecting Boundaries

In the framework of graded quantum inverse scattering method, we obtain the eigenvalues and the eigenvectors of the Osp(l|2) model with reflecting boundary conditions in FBF background. The corresponding Bathe ansatz equations are obtained.     

Finite volume multigrid method of the planar contraction flow of a viscoelastic fluid

This paper reports on a numerical algorithm for the steady flow of viscoelastic fluid. The conservative and constitutive equations are solved using the finite volume method (FVM) with a hybrid scheme for the velocities and first‐order upwind approximation for the viscoelastic stress. A non‐uniform staggered grid system is used. The iterative SIMPLE algorithm is employed to relax the coupled momentum and continuity equations. The non‐linear algebraic equations over the flow domain are solved iteratively by the symmetrical coupled Gauss–Seidel (SCGS) method. In both, the full approximation storage (FAS) multigrid algorithm is used. An Oldroyd‐B fluid model was selected for the calculation. Results are reported for planar 4:1 abrupt contraction at various Weissenberg numbers. The solutions are found to be stable and smooth. The solutions show that at high Weissenberg number the domain must be long enough. The convergence of the method has been verified with grid refinement. All the calculations have been performed on a PC equipped with a Pentium III processor at 550 MHz. Copyright © 2001 John Wiley & Sons, Ltd.     

Perturbation method for determining the group of invariance of hierarchical models

We propose a perturbation method for determining the (largest) group of invariance of a toric ideal defined in [S. Aoki, A. Takemura, The largest group of invariance for Markov bases and toric ideals, J. Symbolic Comput. 43 (5) (2008) 342–358]. In the perturbation method, we investigate how a generic element in the row space of the configuration defining a toric ideal is mapped by a permutation of the indeterminates. Compared to the proof by Aoki and Takemura which was based on stabilizers of a subset of indeterminates, the perturbation method gives a much simpler proof of the group of invariance. In particular, we determine the group of invariance for a general hierarchical model of contingency tables in statistics, under the assumption that the numbers of the levels of the factors are generic. We prove that it is a wreath product indexed by a poset related to the intersection poset of the maximal interaction effects of the model.     

A Robust Algorithm for Blind Total Variation Restoration

Image restoration is a fundamental problem in image processing. Blind image restoration has a great value in its practical application. However, it is not an easy problem to solve due to its complexity and difficulty. In this paper, we combine our robust algorithm for known blur operator with an alternating minimization implicit iterative scheme to deal with blind deconvolution problem, recover the image and identify the point spread function（PSF）. The only assumption needed is satisfy the practical physical sense. Numerical experiments demonstrate that this minimization algorithm is efficient and robust over a wide range of PSF and have almost the same results compared with known PSF algorithm.     

Numerical analysis of turbulent flow separation in a rectangular duct with a sharp 180‐degree turn by algebraic Reynolds stress model

Turbulent flow in a rectangular duct with a sharp 180‐degree turn is difficult to predict numerically because the flow behavior is influenced by several types of forces, including centrifugal force, pressure‐driven force, and shear stress generated by anisotropic turbulence. In particular, this type of flow is characterized by a large‐scale separated flow, and it is difficult to predict the reattachment point of a separated flow. Numerical analysis has been performed for a turbulent flow in a rectangular duct with a sharp 180‐degree turn using the algebraic Reynolds stress model. A boundary‐fitted coordinate system is introduced as a method for coordinate transformation to set the boundary conditions next to complicated shapes. The calculated results are compared with the experimental data, as measured by a laser‐Doppler anemometer, in order to examine the validity of the proposed numerical method and turbulent model. In addition, the possibility of improving the wall function method in the separated flow region is examined by replacing the log‐law velocity profile for a smooth wall with that for a rough wall. The analysis results indicated that the proposed algebraic Reynolds stress model can be used to reasonably predict the turbulent flow in a rectangular duct with a sharp 180‐degree turn. In particular, the calculated reattachment point of a separated flow, which is difficult to predict in a turbulent flow, agrees well with the experimental results. In addition, the calculation results suggest that the wall function method using the log‐law velocity profile for a rough wall over a separated flow region has some potential for improving the prediction accuracy. Copyright © 2007 John Wiley & Sons, Ltd.     

A multigrid procedure for Cartesian ghost‐cell methods

This paper proposes a multigrid technique for Cartesian grid flow solvers. A recently developed ghost body‐cell method for inviscid flows is combined with a nested‐level local refinement procedure, which employs multigrid to accelerate convergence to steady state. Different from standard multigrid applications for body‐fitted grids, a fictitious residual needs to be defined in the ghost cells to perform a correct residual collection and thus to avoid possible stalling of the multigrid procedure. The efficiency of the proposed local refinement multigrid Cartesian method is demonstrated for the case of the inviscid subsonic flow past a circular body. Copyright © 2008 John Wiley & Sons, Ltd.